Contractible cycles in graphs with large minimum degree
نویسندگان
چکیده
منابع مشابه
Hamilton cycles in split graphs with large minimum degree
A graph G is called a split graph if the vertex-set V of G can be partitioned into two subsets V1 and V2 such that the subgraphs of G induced by V1 and V2 are empty and complete, respectively. In this paper, we characterize hamiltonian graphs in the class of split graphs with minimum degree δ at least |V1| − 2.
متن کاملLong D3-cycles in graphs with large minimum degree
It is shown that if G is a 2-connected graph on n vertices, with minimum degree δ such that n ≤ 4δ− 6, and with a maximum independent set of cardinality α, then G contains a cycle of length at least min {n, n+ 2δ − 2α− 2} or G ∈ F , where F denotes a well-known class of nonhamiltonian graphs of connectivity 2.
متن کاملLong cycles in graphs with prescribed toughness and minimum degree
A cycle C of a graph G is a D~-cycle if every component of G V(C) has order less than 2. Using the notion of D~-cycles, a number of results are established concerning long cycles in graphs with prescribed toughness and minimum degree. Let G be a t-tough graph on n/> 3 vertices. If 6 > n/(t + 2) + 2 2 for some 2 ~< t + 1, then G contains a Dx-cycle. In particular, if 6>n/(t+ 1)--1, then G is ham...
متن کاملLong paths and cycles in random subgraphs of graphs with large minimum degree
For a given finite graph G of minimum degree at least k, let Gp be a random subgraph of G obtained by taking each edge independently with probability p. We prove that (i) if p ≥ ω/k for a function ω = ω(k) that tends to infinity as k does, then Gp asymptotically almost surely contains a cycle (and thus a path) of length at least (1− o(1))k, and (ii) if p ≥ (1 + o(1)) ln k/k, then Gp asymptotica...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00017-9